Elements with generalized bounded conjugation orbits
نویسندگان
چکیده
منابع مشابه
Nilpotent Orbits and Commutative Elements
Let W be a simply-laced Coxeter group with generating set S, and let Wc denote the subset consisting of those elements whose reduced expressions have no substrings of the form sts for any non-commuting s; t 2 S. We give a root system characterization of Wc, and in the case where W corresponds to a nite Weyl group, show that Wc is a union of Spaltenstein-Springer-Steinberg cells. The latter is v...
متن کاملElements with bounded height in number fields
We give a constructive proof of the fact that there exist only finitely many elements with bounded height in number fields. This provides an efficient method to enumerate all those elements. Such a method is helpful to compute bases on elliptic curves. Mathematics subject classification numbers, 11R33, 11G50, 14G05.
متن کاملBounded Orbits Conjecture and Diophantine Approximation
We describe and generalize S.G. Dani’s correspondence between bounded orbits in the space of lattices and systems of linear forms with certain Diophantine properties. The solution to Margulis’ Bounded Orbit Conjecture is used to generalize W. Schmidt’s theorem on abundance of badly approximable systems of linear forms.
متن کاملParametrization by polytopes of intersections of orbits by conjugation
Let S be an n×n real symmetric matrix with spectral decomposition S = Q ΛQ, where Q is an orthogonal matrix and Λ is diagonal with simple spectrum {λ1, . . . , λn}. Also let OS e RS be the orbits by conjugation of S by, respectively, orthogonal matrices and upper triangular matrices with positive diagonal. Denote by FS the intersection OS ∩RS . We show that the map F : F̄S → R n taking S′ = (Q) ...
متن کاملColouring graphs with bounded generalized colouring number
Given a graph G and a positive integer p, χp(G) is the minimum number of colours needed to colour the vertices of G so that for any i ≤ p, any subgraph H of G of tree-depth i gets at least i colours. This paper proves an upper bound for χp(G) in terms of the k-colouring number colk(G) of G for k = 2p−2. Conversely, for each integer k, we also prove an upper bound for colk(G) in terms of χk+2(G)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2001
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-01-05945-7